Division point measures from primitive substitutions
نویسندگان
چکیده
منابع مشابه
Asymptotic orbits of primitive substitutions
A primitive, aperiodic substitution on d letters has at most d asymptotic orbits; this bound is sharp. Since asymptotic arc components in tiling spaces associated with substitutions are in 1-1 correspondence with asymptotic words, this provides a bound for those as
متن کاملProfinite Groups Associated with Weakly Primitive Substitutions
A uniformly recurrent pseudoword is an element of a free profinite semigroup in which every finite factor appears in every sufficiently long finite factor. An alternative characterization is as a pseudoword which is a factor of all its infinite factors, that is one which lies in a J -class with only finite words strictly J -above it. Such a J -class is regular and therefore it has an associated...
متن کاملBalances for fixed points of primitive substitutions
An in!nite word de!ned over a !nite alphabet A is balanced if for any pair (!;!′) of factors of the same length and for any letter a in the alphabet ‖!|a − |!|a|6 1; where |!|a denotes the number of occurrences of the letter a in the word !. In this paper, we generalize this notion and introduce a measure of balance for an in!nite sequence. In the case of !xed points of primitive substitutions,...
متن کاملPoint substitutions in albumin genetic variants from Asia.
Despite their rarity and physiologically neutral character, more inherited structural variants of serum albumin (alloalbumins) are known than for any other human protein except hemoglobin. Including three previously unreported examples described here, we have identified 13 different point substitutions in alloalbumins of Japanese origin. Of these only albumin B and two proalbumins have been rep...
متن کاملA theorem of Cobham for non-primitive substitutions
Given a subset E of N = {0, 1, 2, · · · } can we find an elementary algorithm (i.e., a finite state automaton) which accepts the elements of E and rejects those that do not belong to E? In 1969 A. Cobham showed that the existence of such an algorithm deeply depends on the numeration base. He stated [Co1]: Let p and q be two multiplicatively independent integers (i.e., p 6= q for all integers k,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expositiones Mathematicae
سال: 2015
ISSN: 0723-0869
DOI: 10.1016/j.exmath.2013.12.009